Gradient Descent Optimization-Based SINS Self-Alignment Method and Error Analysis
نویسندگان
چکیده
In this paper, the self-alignment for stationary strapdown inertial navigation system (SINS) is formulated as an optimization problem, and two gradient descent optimization-based SINS methods (GD1 GD2) are proposed. The highlight lies in that quaternion-based objective functions firstly to solve problem. Different from conventional initial alignment methods, we construct a function using gravity, Earth rate local latitude information GD1, employs method achieve minimum of function. Secondly, further improve GD2 by measurements IMU represent instead directly. Thus, more competent when not available. addition, also analyze bias errors accelerometer gyroscope quaternion normality error GD1 respectively. Moreover, based on analysis results, scale factor introduced reduce caused biases. Simulation static experiment implemented test performances method, results verify accuracy speed proposed methods.
منابع مشابه
Optimization Analysis of Adaptive UKF Filtering Algorithm in Self Alignment of SINS
In SINS, the inertial components are directly mounted on the carrier.The error can be divided into deterministic error and random drift error (dynamic error), in which, the formercan be compensated. In this case, the initial alignment of the pure static base can achieve a high accuracy. In the practical application, the dynamic error is directly reflected in the inertial device because of influ...
متن کاملAn Improved Coarse Alignment Algorithm for Odometer-Aided SINS Based on the Optimization Design Method
An improved coarse alignment (ICA) algorithm is proposed in this paper with a focus on improving alignment accuracy of odometer-aided strapdown inertial navigation system (SINS) under variable velocity and variable acceleration condition. In the proposed algorithm, the outputs of inertial sensors and odometer in a sampling interval are linearized rather than assumed to be a constant, which impr...
متن کاملA New Descent Nonlinear Conjugate Gradient Method for Unconstrained Optimization
In this paper, a new nonlinear conjugate gradient method is proposed for large-scale unconstrained optimization. The sufficient descent property holds without any line searches. We use some steplength technique which ensures the Zoutendijk condition to be held, this method is proved to be globally convergent. Finally, we improve it, and do further analysis.
متن کاملFast gradient descent method for Mean-CVaR optimization
We propose an iterative gradient descent procedure for computing approximate solutions for the scenario-based mean-CVaR portfolio selection problem. This procedure is based on an algorithm proposed by Nesterov [13] for solving non-smooth convex optimization problems. Our procedure does not require any linear programming solver and in many cases the iterative steps can be solved in closed form. ...
متن کاملA Gradient Descent Method for Optimization of Model Microvascular Networks
Within animals, oxygen exchange occurs within networks containing potentially billions of microvessels that are distributed throughout the animal’s body. Innovative imaging methods now allow for mapping of the architecture and blood flows within real microvascular networks. However, these data streams have so far yielded little new understanding of the physical principles that underlie the orga...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2021
ISSN: ['2169-3536']
DOI: https://doi.org/10.1109/access.2020.3048695